The Brunn–Minkowski–Firey inequality for nonconvex sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces

By virtue of convexification techniques, we study best approximations to a closed set C in a Hilbert space as well as perturbation conditions relative to C and a nonlinear inequality system. Some results on equivalence of the best approximation and the basic constraint qualification are established.

متن کامل

The Hamiltonian Inclusion for Nonconvex Velocity Sets

Since Clarke’s 1973 proof of the Hamiltonian inclusion for optimal control problems with convex velocity sets, there has been speculation (and, more recently, speculation relating to a stronger, partially convexified version of the Hamiltonian inclusion) as to whether these necessary conditions are valid in the absence of the convexity hypothesis. The issue was in part resolved by Clarke himsel...

متن کامل

Transversality and Alternating Projections for Nonconvex Sets

We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear convergence. When the two sets are semi-algebraic and bounded, but not necessarily transversal, we nonetheless prove subsequence convergence.

متن کامل

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

متن کامل

Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets

This paper discusses computational complexity of conceptual successive convex relaxation methods proposed by Kojima and Tunn cel for approximating a convex relaxation of a compact subset F = fx 2 C 0 : p(x) 0 (8p() 2 P F)g of the n-dimensional Euclidean space R n. Here C 0 denotes a nonempty compact convex subset of R n , and P F a set of nitely or innnitely many quadratic functions. We evaluat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2012

ISSN: 0196-8858

DOI: 10.1016/j.aam.2011.11.003